Economic consequences of Nth-degree risk increases and Nth-degree risk attitudes
نویسندگان
چکیده
منابع مشابه
A random nth-price auction
Second-price auctions are designed to induce people to reveal their private preferences for a good. Laboratory evidence suggests that while these auctions do a reasonable job on aggregate, they fall short at the individual level, especially for bidders who are off-margin of the market-clearing price. Herein we introduce and explore whether a random nth-price auction can engage all bidders to bi...
متن کاملUltrastability of nth minimal errors
We use the ultraproduct technique to study local properties of basic quantities of information-based complexity theory – the n-th minimal errors. We consider linear and nonlinear operators in normed spaces, information consists of continuous linear functionals and is assumed to be adaptive. We establish ultrastability and disprove regularity of n-th minimal errors. As a consequence, we answer a...
متن کاملthe study of practical and theoretical foundation of credit risk and its coverage
پس از بررسی هر کدام از فاکتورهای نوع صنعت, نوع ضمانت نامه, نرخ بهره , نرخ تورم, ریسک اعتباری کشورها, کارمزد, ریکاوری, gdp, پوشش و وثیقه بر ریسک اعتباری صندوق ضمانت صادرات ایران مشخص گردید که همه فاکتورها به استثنای ریسک اعتباری کشورها و کارمزد بقیه فاکتورها رابطه معناداری با ریسک اعتباری دارند در ضمن نرخ بهره , نرخ تورم, ریکاوری, و نوع صنعت و ریسک کشورها اثر عکس روی ریسک اعتباری داردو پوشش, وثی...
15 صفحه اولHSI based colour image equalization using iterative nth root and nth power
In this paper an equalization technique for colour images is introduced. The method is based on n th root and n th power equalization approach but with optimization of the mean of the image in different colour channels such as RGB and HSI. The performance of the proposed method has been measured by the means of peak signal to noise ratio. The proposed algorithm has been compared with convention...
متن کاملThe Adjacency Matrix and The nth Eigenvalue
In this lecture, I will discuss the adjacency matrix of a graph, and the meaning of its smallest eigenvalue. This corresponds to the largest eigenvalue of the Laplacian, which we will examine as well. We will relate these to bounds on the chromatic numbers of graphs and the sizes of independent sets of vertices in graphs. In particular, we will prove Hoffman’s bound, and some generalizations. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Risk and Uncertainty
سال: 2013
ISSN: 0895-5646,1573-0476
DOI: 10.1007/s11166-013-9176-6